Phase transitions in the $q$-coloring of random hypergraphs

نویسندگان

  • Marylou Gabrié
  • Varsha Dani
  • Guilhem Semerjian
  • Lenka Zdeborová
چکیده

Marylou Gabrié Laboratoire de physique statistique, Département de physique de l’ENS, Ecole normale supérieure, Université Paris Diderot, UPMC Univ. Paris 06, CNRS, PSL Research University, 75005 Paris, France Sorbonne Universités, UPMC Univ. Paris 06, Université Paris Diderot, Ecole normale supérieure, CNRS, Laboratoire de Physique Statistique (LPS ENS), 75005 Paris, France and Université Paris Diderot, Sorbonne Paris Cité, Laboratoire de Physique Statistique de l’ENS (LPS ENS), Ecole normale supérieure, UPMC Univ. Paris 06, CNRS, 75005 Paris, France

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hypergraph coloring up to condensation

Improving a result of Dyer, Frieze and Greenhill [Journal of Combinatorial Theory, Series B, 2015], we determine the q-colorability threshold in random k-uniform hypergraphs up to an additive error of ln2+εq , where limq→∞ εq = 0. The new lower bound on the threshold matches the “condensation phase transition” predicted by statistical physics considerations [Krzakala et al., PNAS 2007]. Mathema...

متن کامل

Phase Transitions and Computational Difficulty in Random Constraint Satisfaction Problems

We review the understanding of the random constraint satisfaction problems, focusing on the q-coloring of large random graphs, that has been achieved using the cavity method. We also discuss the properties of the phase diagram in temperature, the connections with the glass transition phenomenology in physics, and the related algorithmic issues.

متن کامل

Randomly coloring simple hypergraphs

We study the problem of constructing a (near) uniform random proper q-coloring of a simple k-uniform hypergraph with n vertices and maximum degree ∆. (Proper in that no edge is mono-colored and simple in that two edges have maximum intersection of size one). We show that if for some α < 1 we have ∆ ≥ n and q ≥ ∆ then Glauber dynamics will become close to uniform in O(n log n) time from a random...

متن کامل

Magnetic Properties and Phase Transitions in a Spin-1 Random Transverse Ising Model on Simple Cubic Lattice

Within the effective-field theory with correlations (EFT), a transverse random field spin-1 Ising model on the simple cubic (z=6) lattice is studied. The phase diagrams, the behavior of critical points, transverse magnetization,  internal energy, magnetic specific heat are obtained numerically and discussed for different values of p the concentration of the random transverse field.

متن کامل

Randomly coloring simple hypergraphs with fewer colors

We study the problem of constructing a (near) uniform random proper q-coloring of a simple k-uniform hypergraph with n vertices and maximum degree ∆. (Proper in that no edge is mono-colored and simple in that two edges have maximum intersection of size one). We show that if q ≥ max { Ck log n, 500k 3∆1/(k−1) } then the Glauber Dynamics will become close to uniform in O(n log n) time, given a ra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1707.01983  شماره 

صفحات  -

تاریخ انتشار 2017